Structured Matrices
نویسندگان
چکیده
The expression structured matrices appeared for the first time in a conference title in 1995, specifically in the session “Algorithms for Structured Matrices”, organized within the SPIE conference, held in San Diego (USA) [1, Session 6] and in the “Minisymposium on Structured Matrices” within the ILAS conference, held in Atlanta (USA) [2]. These first experiences led to the organization, in 1996, of the first two conferences specifically devoted to structured matrices: “International Workshop on Numerical Methods for Structured Matrices in Filtering and Control”, held in Santa Barbara (USA) [3] and “Toeplitz Matrices: Structures, Algorithms and Applications” held in Cortona (Italy) [4]. The organization of specific conferences on structured matrices has given the opportunity to meet together researchers working on theoretical and computational properties of structured matrices, and researchers working on applications. This exchange of experts from different fields has led to strong benefits to researches interested in structured matrices. This anniversary gives the opportunity to reflect on the state-of-art in the research involving matrix structures in the last 15 years. The aim of this talk is to survey some key results achieved along different directions, paying special attention to the significant contribution of the italian research group on structured numerical linear algebra, having its main site in Pisa. In particular, the four editions of the Cortona Workshop offer a privileged point of view in this context. Some pointers to future research perspectives will be also given.
منابع مشابه
Some Results on Polynomial Numerical Hulls of Perturbed Matrices
In this paper, the behavior of the pseudopolynomial numerical hull of a square complex matrix with respect to structured perturbations and its radius is investigated.
متن کاملEigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations
We study the perturbation theory of structured matrices under structured rank one perturbations, and then focus on several classes of complex matrices. Generic Jordan structures of perturbed matrices are identified. It is shown that the perturbation behavior of the Jordan structures in the case of singular J-Hamiltonian matrices is substantially different from the corresponding theory for unstr...
متن کاملRank structured matrices: theory, algorithms and applications
In numerical linear algebra much attention has been paid to matrices that are sparse, i.e., containing a lot of zeros. For example, to compute the eigenvalues of a general dense symmetric matrix, this matrix is first reduced to a similar tridiagonal one using an orthogonal similarity transformation. The subsequent QR-algorithm performed on this n×n tridiagonal matrix, takes the sparse structure...
متن کاملA multiple shift QR-step for structured rank matrices
Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays. There exist methods for transforming matrices into structured rank form, QR-algorithms for semiseparable and semiseparable plus diagonal form, methods for reducing structured rank matrices efficiently to Hessenberg form and so forth. Eigenvalue computations for the symmetric case, involving sem...
متن کاملAlgebraic Riccati Matrix Equation for Eigen- Decomposition of Special Structured Matrices; Applications in Structural Mechanics
Abstract—In this paper Algebraic Riccati matrix equation is used for Eigen-decomposition of special structured matrices. This is achieved by similarity transformation and then using algebraic riccati matrix equation to triangulation of matrices. The process is decomposition of matrices into small and specially structured submatrices with low dimensions for fast and easy finding of Eigenpairs. N...
متن کامل